Computing within Memory Using Transforms
نویسندگان
چکیده
This paper presents a new memory paradigm that challenges the conventional view of memory. No longer is memory a passive entity that only stores information; rather, it becomes an active participant in computation. The memory system logically performs dynamic transforms on data, easing the workload of the main processor (or processors). This paper presents several applications which validate the new paradigm.
منابع مشابه
Parallel Three-Dimensional Nonequispaced Fast Fourier Transforms and Their Application to Particle Simulation
In this paper we describe a parallel algorithm for calculating nonequispaced fast Fourier transforms on massively parallel distributed memory architectures. These algorithms are implemented in an open source software library called PNFFT. Furthermore, we derive a parallel fast algorithm for the computation of the Coulomb potentials and forces in a charged particle system, which is based on the ...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملParallel Wavelet Transforms for Image Proccessing
Wavelet Transforms have proved to be very successful in image processing tasks such as image compression , feature detection, and ltering. This paper presents parallel algorithms for computing multi-dimensional wavelet transforms on both shared memory and distributed memory machines. Traditional data partitioning methods for n-dimensional DWTs call for data redistribution once a one dimensional...
متن کاملThe Do! project: distributed programming using Java
Pascale Launay and Jean-Louis Pazat IRISA, Campus de Beaulieu, F35042 RENNES cedex [email protected], [email protected] http://www.irisa.fr/caps/PROJECTS/Do/ Abstract. The aim of the Do! project is to ease the task of programming distributed applications using Java. In a rst step, the programmer writes his application as a shared-memory parallel program, by de ning the components ...
متن کاملA General Algorithm for Computing Distance Transforms in Linear Time
A new general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorith...
متن کامل